package mo.tags.greedy;

public class L122 {

    public int maxProfit(int[] prices) {
        int max = 0;
        for (int i = 1; i < prices.length; i++) {
            max += Math.max(0, prices[i]-prices[i-1]);
        }
        return max;
    }

}
